행렬 쾌속 멱 Xor-sequences (codeforces 691E) You are given n integers a1,a2,...,an a 1 , a 2 , . , a n . , x k is called a “xor-sequence” if for every 1 ≤ i ≤ k - 1 the number of ones in the binary representation of the number xi x i xor x o r x... 행렬 쾌속 멱
Xor-sequences (codeforces 691E) You are given n integers a1,a2,...,an a 1 , a 2 , . , a n . , x k is called a “xor-sequence” if for every 1 ≤ i ≤ k - 1 the number of ones in the binary representation of the number xi x i xor x o r x... 행렬 쾌속 멱